Design Optimization Problem Reformulation Using Singular Value Decomposition
نویسندگان
چکیده
This paper presents a design optimization problem reformulation method based on Singular Value Decomposition (SVD), dimensionality reduction, and unsupervised clustering. The method calculates linear approximations of the associative patterns of symbol co-occurrences in a design problem representation to infer induced interaction/coupling strengths between variables and constraints. Unsupervised clustering of these approximations is used to identify useful reformulations. These two components of the method automate a range of reformulation tasks that have traditionally required different solution algorithms. We explain the method using an analytic model-based decomposition problem, and apply the method to an analytic hydraulic cylinder design problem as an example of heuristic design “case” identification, and to non-analytic problems expressed in FDT and DSM forms as examples of design decomposition. An Aircraft Concept Sizing (ACS) problem is used to empirically validate the method’s performance. The results show that the method can be used to infer multiple well-formed reformulations starting from a single problem representation in a knowledge-lean and training lean manner.
منابع مشابه
Adomian Decomposition Method On Nonlinear Singular Cauchy Problem of Euler-Poisson- Darbuox equation
n this paper, we apply Picard’s Iteration Method followed by Adomian Decomposition Method to solve a nonlinear Singular Cauchy Problem of Euler- Poisson- Darboux Equation. The solution of the problem is much simplified and shorter to arriving at the solution as compared to the technique applied by Carroll and Showalter (1976)in the solution of Singular Cauchy Problem.
متن کاملA novel technique for a class of singular boundary value problems
In this paper, Lagrange interpolation in Chebyshev-Gauss-Lobatto nodes is used to develop a procedure for finding discrete and continuous approximate solutions of a singular boundary value problem. At first, a continuous time optimization problem related to the original singular boundary value problem is proposed. Then, using the Chebyshev- Gauss-Lobatto nodes, we convert the continuous time op...
متن کاملA Learning and Inference Mechanism for Design Optimization Problem (re)-formulation Using Singular Value Decomposition
This paper presents a knowledge-lean learning and inference mechanism based on Singular Value Decomposition (SVD) for design optimization problem (re)-formulation at the problem modeling stage. The distinguishing feature of the mechanism is that it requires very few training cases to extract and generalize knowledge for large classes of problems sharing similar characteristics. The genesis of t...
متن کاملLearning Symbolic Formulations in Design: Syntax, Semantics, Knowledge Reification
An AI algorithm to automate symbolic design reformulation is an enduring challenge in design automation. Existing research shows that design tools either require high levels of knowledge engineering or large databases of training cases. To address these limitations, we present a singular value decomposition (SVD) and unsupervised clustering based method that performs design reformulation by acq...
متن کاملLearning symbolic formulations in design: Syntax, semantics, and knowledge reification
An AI algorithm to automate symbolic design reformulation is an enduring challenge in design automation. Existing research shows that design tools either require high levels of knowledge engineering or large databases of training cases. To address these limitations, we present a singular value decomposition (SVD) and unsupervised clustering based method that performs design reformulation by acq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009